//https://www.nowcoder.com/practice/4436c93e568c48f6b28ff436173b997f?tpId=13&tqId=2273153&ru=%2Fpractice%2F0c1b486d987b4269b398fee374584fc8&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking&sourceUrl=%2Fexam%2Foj%2Fta%3Fpage%3D1%26tpId%3D13%26type%3D13
//思想：先找到n位数的最大值：std：：pow实现

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;


#include <cmath>
#include <vector>
class Solution {
public:
    vector<int> printNumbers(int n) {
        // write code here
        int bit_bigest_val = std::pow(10, n) -1;
        std::vector<int> res_vec{};
        for(int i=1;i<=bit_bigest_val;++i){
            res_vec.emplace_back(i);
        }
        return res_vec;
    }
};